Imperceptible graph injection attack on graph neural networks
نویسندگان
چکیده
Abstract In recent years, Graph Neural Networks (GNNs) have achieved excellent applications in classification or prediction tasks. Recent studies demonstrated that GNNs are vulnerable to adversarial attacks. Modification Attack (GMA) and Injection (GIA) commonly attack strategies. Most graph methods based on GMA, which has a clear drawback: the attacker needs high privileges modify original graph, making it difficult execute practice. GIA can perform attacks without modifying graph. However, many models fail take care of invisibility, i.e., fake nodes be easily distinguished from nodes. To solve above issue, we propose an imperceptible injection attack, named IMGIA. Specifically, IMGIA uses normal distribution sampling mask learning generate node features links respectively, then homophily unnoticeability constraint improve camouflage attack. Our extensive experiments three benchmark datasets demonstrate performs better than existing state-of-the-art methods. As example, shows improvement performance with average increase effectiveness 2%.
منابع مشابه
Ranking Attack Graphs with Graph Neural Networks
Network security analysis based on attack graphs has been applied extensively in recent years. The ranking of nodes in an attack graph is an important step towards analyzing network security. This paper proposes an alternative attack graph ranking scheme based on a recent approach to machine learning in a structured graph domain, namely, Graph Neural Networks (GNNs). Evidence is presented in th...
متن کاملAttack Graph to Graph Database
Databases are an integral part of almost any computing system today, and users heavily rely on the services they provide. When we interact with a computing system, we expect that any data be stored for future use, that the data is able to be looked up quickly, and that we can perform complex queries against the data stored in the database. There are many different emerging database types availa...
متن کاملLink Prediction Based on Graph Neural Networks
Traditional methods for link prediction can be categorized into three main types: graph structure feature-based, latent feature-based, and explicit feature-based. Graph structure feature methods leverage some handcrafted node proximity scores, e.g., common neighbors, to estimate the likelihood of links. Latent feature methods rely on factorizing networks’ matrix representations to learn an embe...
متن کاملKernel Graph Convolutional Neural Networks
Graph kernels have been successfully applied to many graph classification problems. Typically, a kernel is first designed, and then an SVM classifier is trained based on the features defined implicitly by this kernel. This two-stage approach decouples data representation from learning, which is suboptimal. On the other hand, Convolutional Neural Networks (CNNs) have the capability to learn thei...
متن کاملGated Graph Sequence Neural Networks
Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is previous work on Graph Neural Networks (Scarselli et al., 2009), which we modify to use gated recurrent units and modern optimization techniques and then ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2023
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-023-01200-6